The hierarchy of ω 1 - Borel sets 1 The hierarchy of ω 1 - Borel sets Arnold
نویسندگان
چکیده
We consider the ω1-Borel subsets of the reals in models of ZFC. This is the smallest family of sets containing the open subsets of the 2 and closed under ω1 intersections and ω1 unions. We show that Martin’s Axiom implies that the hierarchy of ω1-Borel sets has length ω2. We prove that in the Cohen real model the length of this hierarchy is at least ω1 but no more than ω1 + 1. Some authors have considered ω1-Borel sets in other spaces, ω ω1 1 Mekler and Vaananen [10] and or completely metrizable spaces of uncountable density, Willmott [21]. But in this paper we only consider the space 2. Define the levels of the ω1-Borel hierarchy of subsets of 2 ω as follows: 1. Σ0 = Π ∗ 0 = clopen subsets of 2 ω 2. Σα = { ⋃ β<ω1 Aβ : (Aβ : β < ω1) ∈ (Π<α)1} 3. Πα = { ⋃ β<ω1 Aβ : (Aβ : β < ω1) ∈ (Σ<α)1} 4. Π<α = ⋂ β<α Π ∗ β Σ ∗ <α = ⋃ β<α Σ ∗ β The length of this hierarchy is the smallest α ≥ 1 such that Πα = Σ ∗ α. It is easy to show that if α < ω2 and every ω1-Borel set is Π ∗ <α, then Π ∗ β = Σ ∗ β for some β < α, i.e., bounded hierarchies must have a top class (see Miller [11] Proposition 4 p.235). Thanks to the University of Florida Mathematics Department for their support and especially Jindrich Zapletal, William Mitchell, Jean A. Larson, and Douglas Cenzer for inviting me to the special year in Logic 2006-07 during which most of this work was done. Mathematics Subject Classification 2000: 03E15; 03E35; 03E50
منابع مشابه
On omega context free languages which are Borel sets of infinite rank
This paper is a continuation of the study of topological properties of omega context free languages (ω-CFL). We proved in [Topological Properties of Omega Context Free Languages, Theoretical Computer Science, Volume 262 (1-2), 2001, p. 669697] that the class of ω-CFL exhausts the finite ranks of the Borel hierarchy, and in [Borel Hierarchy and Omega Context Free Languages, Theoretical Computer ...
متن کاملA combinatorial method of tackling the problem of hierarchy collapse, and a theorem of Ajtai
2. Proposition. For all n ∈ ω there exists a subset B of ω such that E n 6= E n+1. This proposition follows from a theorem of M. Sipser about Boolean circuits (see “Borel Sets and Circuit Complexity”, JACM 1983, pp. 61–69), whose presentation we closely follow. On the way, we study a theorem of Ajtai about the structure of classes of sets of the form E n that uses an analogue of the Borel hiera...
متن کاملBorel hierarchy and omega context free languages
We give in this paper additional answers to questions of Lescow and Thomas [Logical Specifications of Infinite Computations, In:”A Decade of Concurrency”, Springer LNCS 803 (1994), 583-621], proving topological properties of omega context free languages (ω-CFL) which extend those of [O. Finkel, Topological Properties of Omega Context Free Languages, Theoretical Computer Science, Vol. 262 (1-2),...
متن کامل- 9 D ec 2 00 7 Borel ranks and Wadge degrees of context free ω - languages
We show that the Borel hierarchy of the class of context free ω-languages, or even of the class of ω-languages accepted by Büchi 1-counter automata, is the same as the Borel hierarchy of the class of ω-languages accepted by Turing machines with a Büchi acceptance condition. In particular, for each recursive non null ordinal α, there exist some Σ α -complete and some Π α -complete ω-languages ac...
متن کاملTopological complexity of locally finite omega -languages
Locally finite omega languages were introduced by Ressayre in [Formal Languages defined by the Underlying Structure of their Words, Journal of Symbolic Logic, 53, number 4, December 1988, p. 1009-1026]. These languages are defined by local sentences and extend ω-languages accepted by Büchi automata or defined by monadic second order sentences. We investigate their topological complexity. All lo...
متن کامل